Poster: Secure Computation of Fingerprint Alignment and Matching
نویسندگان
چکیده
Secure computation with biometric data is a challenging topic and attention to this area has grown during recent years. This is because biometric data is highly sensitive and requires protection when used in a variety of applications including biometric verification and identification. Fingerprint images are one of the most accurate type of biometry used in these applications and they are highly sensitive due to their ability to uniquely identify the data owner. For that reason, when fingerprint data is used in applications, it is desired to properly protect such data. Typically the computation involves comparing two fingerprint representations in different settings ranging from comparing two databases belonging to different entities to searching for a fingerprint in an external database or outsourcing fingerprint comparisons for computational reasons. In this work, we put forward three secure protocols for fingerprint alignment and matching based on the most precise or efficient algorithms in the biometric literature. To the best of our knowledge, this is the first time fingerprint alignment based on minutia points is considered in a secure computation framework due to the complexity of the algorithms. After designing the necessary building blocks, we build the overall protocols and realize them in the two-party setting using garbled circuit evaluation and in the multi-party setting using secret sharing techniques. Keywords—Fingerprint alignment, fingerprint matching, secure computation, garbled circuit evaluation, secret sharing.
منابع مشابه
Secure Fingerprint Alignment and Matching Protocols
We present three private fingerprint alignment and matching protocols, based on precise and efficient fingerprint recognition algorithms that use minutia points. Our protocols allow two or more semi-honest parties to compare privately-held fingerprints in a secure way such that nothing more than an accurate score of how well the fingerprints match is revealed to output recipients. To the best o...
متن کاملOblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
The increasing availability and use of biometric data leads to situations when sensitive biometric data is to be handled by entities who may not be fully trusted or otherwise are not authorized to have full access to such data. This calls for mechanisms of provably protecting biometric data while still allowing the computation to take place. Our focus is on privacy-preserving matching of two fi...
متن کاملSecure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification
The increasing availability and use of biometric data for authentication and other purposes leads to situations when sensitive biometric data is to be handled or used in computation by entities who may not be fully trusted or otherwise are not authorized to have full access to such data. This calls for mechanisms of provably protecting biometric data while still allowing the computation to take...
متن کاملSecure Fingerprint Identification of High Accuracy
The increasing availability and use of biometric data for authentication and other purposes leads to situations when sensitive biometric data is to be handled or used in computation by entities who may not be fully trusted or otherwise authorized to have full access to such data. This calls for mechanisms of provably protecting biometric data while still allowing the computation to take place. ...
متن کاملSymmetric hash functions for secure fingerprint biometric systems
Securing biometrics databases from being compromised is an important research challenge that must be overcome in order to support widespread use of biometrics based authentication. In this paper we present a novel method for securing fingerprints by hashing the fingerprint minutia and performing matching in the hash space. Our approach uses a family of symmetric hash functions and does not depe...
متن کامل